Backtracking-assisted multiplication

Learning multiplication through computer-assisted learning activities

This study develops and implements a computer-assisted learning (CAL) program with both multiplicative facts practices and the instruction of meaning behind these facts. The effectiveness of CAL on the development of multiplication abilities is also explored. Eight CAL activities are developed to teach multiplication to second grade elementary school students. The CAL program is comprised of th...

Relevant Backtracking: Improved Intelligent Backtracking Using Relevance

This work investigates and develops a backtracking algorithm with a novel approach to enumerating and traversing search space. A basic logical framework inspired by relevant logics is presented, highlighting relationships between search and refutation proof construction. Mechanisation of a relevance aware Davis Putnam Logemann Loveland procedure is investigated, and this yields an intelligent b...

Dynamic Backtracking

Because of their occasional need to return to shallow points in a search tree, existing backtracking methods can sometimes erase meaningful progress toward solving a search problem. In this paper, we present a method by which backtrack points can be moved deeper in the search space, thereby avoiding this di culty. The technique developed is a variant of dependency-directed backtracking that use...

Backtracking Influence

Backtracking influence is influence that zigzags in time. For example, backtracking influence exists when an event E1 makes an event E2 more likely by way of a nomic connection that goes from E1 back in time to an event C and then forward in time to E2. I contend that backtracking influence is redundant in the sense that any existing backtracking influence exerted by E1 on E2 is equivalent to E...

Shallow Backtracking Points in an Intelligent Backtracking Schema